cient Organization of Large Multidimensional Arrays

نویسندگان

  • Sunita Sarawagi
  • Michael Stonebraker
چکیده

Large multidimensional arrays are widely used in scientiic and engineering database applications. In this paper, we present methods of organizing arrays to make their access on secondary and tertiary memory devices fast and eecient. We have developed four techniques for doing this: (1) storing the array in multidimensional \chunks" to minimize the number of blocks fetched, (2) reordering the chunked array to minimize seek distance between accessed blocks, (3) maintaining redundant copies of the array, each organized for a diierent chunk size and ordering and (4) partitioning the array onto platters of a tertiary memory device so as to minimize the number of platter switches. Our measurements on real data sets obtained from global change scientists demonstrate that accesses on arrays organized using the above techniques are often an order of magnitude faster than on the original unoptimized data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

E cient Organization of Large Multidimensional Arrays

Large multidimensional arrays are widely used in scienti c and engineering database applications. In this paper, we present methods of organizing arrays to make their access on secondary and tertiary memory devices fast and e cient. We have developed four techniques for doing this: (1) storing the array in multidimensional \chunks" to minimize the number of blocks fetched, (2) reordering the ch...

متن کامل

Eecient Organization of Large Multidimensional Arrays

Large multidimensional arrays are widely used in sci-entiic and engineering database applications. In this paper, we present methods of organizing arrays to make their access on secondary and tertiary memory devices fast and eecient. We have developed four techniques for doing this: (1) storing the array in multidimensional \chunks" to minimize the number of blocks fetched, (2) reordering the c...

متن کامل

cient Coding Schemes for the Hard Square Model

The hard square model consists of all binary arrays in which the s are isolated both hor izontally and vertically Based on a certain proba bility measure de ned on those arrays an e cient variable to xed rate encoder scheme is obtained that maps unconstrained binary words into arrays that sat isfy the hard square model For su ciently large ar rays the average rate of the encoder approaches a va...

متن کامل

An Efficient Encoding Scheme to Handle the Address Space Overflow for Large Multidimensional Arrays

We present a new implementation scheme of multidimensional array for handling large scale high dimensional datasets that grows incrementally. The scheme implements a dynamic multidimensional extendible array employing a set of two dimensional extendible arrays. The multidimensional arrays provide many advantages but it has some problems as well. The Traditional Multidimensional array is not dyn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994